Optimal obstacle placement with disambiguations
نویسندگان
چکیده
منابع مشابه
Optimal Trajectory Planning of a Mobile Robot with Spatial Manipulator For Spatial Obstacle Avoidance
Mobile robots that consist of a mobile platform with one or many manipulators mounted on it are of great interest in a number of applications. Combination of platform and manipulator causes robot operates in extended work space. The analysis of these systems includes kinematics redundancy that makes more complicated problem. However, it gives more feasibility to robotic systems because of the e...
متن کاملOn - Line Sub - Optimal Obstacle
On-Line Sub-Optimal Obstacle Avoidance Zvi Shiller Mechanical and Aerospace Engineering University of California Los Angeles, CA 90095 Abstract This paper presents an on-line planner for sub-optimal obstacle avoidance. It generates near-shortest paths incrementally by avoiding obstacles optimally one at a time. In known environments, obstacles are avoided in an order determined by a global crit...
متن کاملOptimal Data Placement In
A problem inherent to the performance of disk systems is the data placement in cyinders in such a way that the seek time is minimized. If successive searchers are independent, then the optimal placement for conventional one-headed disk systems is the organ-pipe arrangement. According to this arrangement the most frequent cylinder is placed in the central location, while the less frequent cylind...
متن کاملOptimal Polygon Placement
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of points in S. We present two solutions to this problem that represent time versus space tradeoffs. The first algorithm runs in O(n3m3) expected time using O(n2m2) space. The second algorithm runs in O(n3m3 log(nm)) det...
متن کاملOptimal Distribution Assignment Placement
Dynamic data redistribution is a key technique for maintaining data locality and workload balance in data-parallel languages like HPF. On the other hand, redistributions can be very expensive and signiicantly degrade a program's performance. In this article, we present a novel and aggressive approach for avoiding unnecessary remappings by eliminating partially dead and partially redundant distr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Statistics
سال: 2012
ISSN: 1932-6157
DOI: 10.1214/12-aoas556